Robust 1-median location problem on a tree
نویسندگان
چکیده
In combinatorial optimization, and particularly in location problems, the most used robustness criteria rely either on maximal cost or on maximal regret. However, it is well known that these criteria are too conservative. In this paper, we present a new robustness approach, called lexicographic α-robustness, which compensates for the drawbacks of the criteria based on the worst case. We apply this notion to the 1-median location problem under uncertainty and we give a polynomial algorithm to determine robust solutions in the case of a tree graph.
منابع مشابه
Robust location problems with pos/neg weights on a tree
In this paper we consider diierent aspects of robust 1-median problems on a tree network with uncertain or dynamically changing edge lengths and vertex weights which can also take negative values. The dynamic nature of a parameter is modeled by a linear function of time. A linear algorithm is designed for the absolute dynamic robust 1-median problem on a tree. The dynamic robust deviation 1-med...
متن کاملA Linear Approach to Node-restricted Minmax Regret Robust 1-median on a Tree
In this paper, we consider the node-restricted minmax regret 1-median problem on a tree network where node weights are deterministic and edge lengths are subject to uncertainty with unknown symmetric distribution. There have been proposed some complicated and time-consuming algorithms to obtain robust solutions for robust 1-median problem. We formulate the robust regret function as a mixed inte...
متن کاملA Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
j∈Si d(j, F ) , where for any F ⊆ V , d(j, F ) = minf∈F d(j, f). This is a “min-max” or “robust” version of the k-median problem. Note that in contrast to the recent papers on robust and stochastic problems, we have only one stage of decisionmaking where we select a set of k facilities to open. Once a set of open facilities is fixed, each client in the uncertain client-set connects to the...
متن کاملThe robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملA Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem
Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...
متن کامل